High-performance 3D Unstructured Mesh Deformation Using Rank Structured Matrix Computations
نویسندگان
چکیده
The Radial Basis Function (RBF) technique is an interpolation method that produces high-quality unstructured adaptive meshes. However, the RBF-based boundary problem necessitates solving a large dense linear system with cubic arithmetic complexity computationally expensive and prohibitive in terms of memory footprint. In this article, we accelerate computations 3D mesh deformation based on RBF interpolations by exploiting rank structured property matrix operator. main idea consists approximating off-diagonal tiles up to application-dependent accuracy threshold. We highlight robustness our multiscale solver assessing its numerical using realistic geometries. particular, model population novel coronaviruses. report compare performance results various parallel systems against existing state-of-the-art solvers.
منابع مشابه
Aiaa 99–0537 Large-scale Parallel Unstructured Mesh Computations for 3d High-lift Analysis
A complete " geometry to drag-polar " analysis capability for three-dimensional high-lift configurations is described. The approach is based on the use of unstructured meshes in order to enable rapid turnaround for complicated geomtries which arise in high-lift configurations. Special attention is devoted to creating a capability for enabling analyses on highly resolved grids. Unstructured mesh...
متن کاملLarge-scale Parallel Unstructured Mesh Computations for 3D High-lift Analysis
A complete “geometry to drag-polar” analysis capability for three-dimensional high-lift configurations is described. The approach is based on the use of unstructured meshes in order to enable rapid turnaround for complicated geometries that arise in high-lift configurations. Special attention is devoted to creating a capability for enabling analyses on highly resolved grids. Unstructured meshes...
متن کاملFast Structured Matrix Computations: Tensor Rank and Cohn-Umans Method
We discuss a generalization of the Cohn–Umans method, a potent technique developed for studying the bilinear complexity of matrix multiplication by embedding matrices into an appropriate group algebra. We investigate how the Cohn–Umans method may be used for bilinear operations other than matrix multiplication, with algebras other than group algebras, and we relate it to Strassen’s tensor rank ...
متن کاملUnstructured Mesh Generation For Viscous Flow Computations
This paper presents a robust and automated approach to generate unstructured hybrid grids comprised of tetrahedra, prisms, and pyramids for high Reynolds number flow computations. The hybrid mesh generation starts with isotropic tetrahedral grids to enhance the robustness. The tetrahedra near no-slip walls are shifted inward and the resulting gap between the tetrahedra and the walls is filled u...
متن کاملDesign Patterns for High-Performance Matrix Computations
For modeling, simulation and design of complex systems, high-performance and easy-to-use matrix computation software is always needed. Traditionally, one would make use of standard software packages written in FORTRAN, such as LINPACK, EISPACK and LAPACK. Today, the availability of commercial products like MATLAB makes matrix computations almost as simple as just writing down mathematical expre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Parallel Computing
سال: 2022
ISSN: ['2329-4949', '2329-4957']
DOI: https://doi.org/10.1145/3512756